A Quasigroup Based Random Number Generator for Resource Constrained Environments

نویسندگان

  • Matthew Battey
  • Abhishek Parakh
چکیده

This paper proposes a pseudo random number generator (PRNG) based on quasigroups. The proposed PRNG has low memory requirements, is autonomous and the quality of the output stream of random numbers is better than other available standard PRNG implementations (commercial and open source) in majority of the tests. Comparisons are done using the benchmark NIST Statistical Test Suite and compression tools. Results are presented for quality of raw stream of random numbers and for encryption results using these random numbers. Index Terms – cryptography, random number generation, quasigroups, efficient encryption

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Breaking Another Quasigroup-Based Cryptographic Scheme

In their paper “A Quasigroup Based Random Number Generator for Resource Constrained Environments”, the authors Matthew Battey and Abhishek Parakh propose the pseudo random number generator LOQG PRNG 256. We show several highly efficient attacks on LOQG PRNG 256.

متن کامل

Cryptanalysis and Improvements of the Quasigroup Block Cipher

This article presents results on the cryptanalysis of a quasigroup block cipher, which was previously proposed. The quasigroup block cipher provides an attractive encryption system for resource constrained environments. Here, we identify the “odd-bit” and “identical-word” problems with the cipher and recommend configurations of the QGBC to counter these. Following this analysis, we propose an i...

متن کامل

An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation

In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSG...

متن کامل

Unbiased Random Sequences from Quasigroup String Transformations

The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) is increasing every day. Many sources of randomness possess the property of stationarity. However, while a biased die may be a good source of entropy, many applications require input in the form of unbiased bits, rather than bia...

متن کامل

On Generators of Random Quasigroup Problems

Random problems are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representative of structured random problems that are closer to real-life problems. In this paper, we study generators for Quasigroup Completion Problem (QCP) and Quasigroups with Holes (QWH). We propose an improvement of the generator for QCP that produces a lar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2012  شماره 

صفحات  -

تاریخ انتشار 2012